From indexed grammars to generating functions
نویسندگان
چکیده
We extend the DSV method of computing the growth series of an unambiguous context-free language to the larger class of indexed languages. We illustrate the technique with numerous examples.
منابع مشابه
New Frontiers Beyond Context-Freeness: DI-Grammars And DI-Automata
A new class of formal languages will be defined the Distributed Index Languages (DI-languages). The grammar-formalism generating the new class the DI-grammars cover unbound dependencies in a rather natural way. The place of DI-languages in the Chomsky-hierarchy will be determined: Like Aho's indexed Languages, DI-languages represent a proper subclass of Type 1 (contextsensitive languages) and p...
متن کاملSequentially Indexed Grammars
This paper defines the grammar class of sequentially indexed grammars. Sequentially indexed grammars are the result of a change in the index stack handling mechanism of indexed grammars [Aho68, Aho69]. Sequentially indexed grammars are different from linear indexed grammars [Gaz88]. Like indexed languages, sequentially indexed languages are a fully abstract language class. Unlike indexed langua...
متن کاملA Comparative Study on Adjunct Array Token Petri Nets with Some Classes of Array Grammars
Adjunct Array Token Petri Net Structures (AATPNS) are recently introduced rectangular picture generating devices which extended the Array token Petri net Structures. AATPNS generated context free and context sensitive kolam array languages and tabled 0L/1L languages. In this paper we compare AATPNS with some simple and expressive picture grammar models like extended pure 2D context-free grammar...
متن کاملA Generalization of Linear Indexed Grammars Equivalent to Simple Context-Free Tree Grammars
I define a generalization of linear indexed grammars that is equivalent to simple context-free tree grammars in the same way that linear indexed grammars are equivalent to tree-adjoining grammars.
متن کاملPrefix probabilities for linear indexed grammars
vVe show how prefix probabilities can be computed for stochastic linear indexed grammars (SLIGs). Our results apply as weil to stochastic tree-adjoining grammars (STAGs), due to their equivalence to SLIGs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- RAIRO - Theor. Inf. and Applic.
دوره 47 شماره
صفحات -
تاریخ انتشار 2013